Non-Fregean Propositional Logic with Quantifiers
نویسندگان
چکیده
منابع مشابه
Reflexives and non-Fregean quantifiers
Natural languages display a great variety of constructions which denote non-Freagean quantifiers that is complex quantifiers which are not iterations of simpler quantifiers. Such quantifiers have been extensively studied by Ed (Clark and Keenan (1986), Keenan (1987b), Keenan (1992)). Usually expressions denoting non-Fregean quantifiers are not lexically simple and often they are not syntactic c...
متن کاملPropositional Dynamic Logic with Program Quantifiers
We consider an extension QPDL of Segerberg-Pratt’s Propositional Dynamic Logic PDL, with program quantification, and study its expressive power and complexity. A mild form of program quantification is obtained in the calculus μPDL, extending PDL with recursive procedures (i.e. context free programs), which is known to be Π 1 -complete. The unrestricted program quantification we consider leads t...
متن کاملOn propositional quantifiers in provability logic
The first order theory of the Diagonalizable Algebra of Peano Arithmetic (DA(PA)) represents a natural fragment of provability logic with propositional quantifiers. We prove that the first order theory of the O-generated subalgebra of DA(PA) is decidable but not elementary recursive; the same theory, enriched by a single free variable ranging over DA(PA), is already undecidable. This gives a ne...
متن کاملQuantifiers and Propositional Attitudes
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملA Propositional Proof System with Permutation Quantifiers
Propositional proof complexity is a field of theoretical computer science which concerns itself with the lengths of formal proofs in various propositional proof systems. Frege systems are an important class of propositional proof systems. Extended Frege augments them by allowing the introduction of new variables to abbreviate formulas. Perhaps the largest open question in propositional proof co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2016
ISSN: 0029-4527
DOI: 10.1215/00294527-3470547